The Word Problem Distinguishes Counter Languages
نویسندگان
چکیده
Counter automata are more powerful versions of finitestate automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of Z is accepted by a nondeterministic m-counter automaton if and only if m ≥ n.
منابع مشابه
. G R ] 1 7 Ju n 20 06 THE WORD PROBLEM DISTINGUISHES COUNTER LANGUAGES
Counter automata are more powerful versions of finitestate automata where addition and subtraction operations are permitted on a set of n integer registers, called counters. We show that the word problem of Zn is accepted by a nondeterministic m-counter automaton if and only if m ≥ n.
متن کاملGroups and semigroups with a one-counter word problem
We prove that a finitely generated semigroup whose word problem is a one-counter language has a linear growth function. This provides us with a very strong restriction on the structure of such a semigroup which, in particular, yields an elementary proof of a result of Herbst, that a group with a one-counter word problem is virtually cyclic. We prove also that the word problem of a group is an i...
متن کاملG-automata, Counter Languages and the Chomsky Hierarchy
We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class M then the language of any G-automaton is in the class M. It follows that the so called counter languages (languages of Zn-automata) are context-sensitive, and further that counter languages are indexed if and only if the word probl...
متن کاملDescriptions of groups using formal language theory
Descriptions of Groups using Formal Language Theory Gabriela Aslı Rino Nesin This work treats word problems of finitely generated groups and variations thereof, such as word problems of pairs of groups and irreducible word problems of groups. These problems can be seen as formal languages on the generators of the group and as such they can be members of certain well-known language classes, such...
متن کاملCharacterizing Word Problems of Groups
The word problem of a finitely generated group is a fundamental notion in group theory; it can be defined as the set of all the words in the generators of the group that represent the identity element of the group. This definition allows us to consider a word problem as a formal language and a rich topic of research concerns the connection between the complexity of this language and the algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006